Equational Termination by Semanti Labelling
نویسندگان
چکیده
منابع مشابه
Equational Termination by Semantic Labelling
Semantic labelling is a powerful tool for proving termination of term rewrite systems. The usefulness of the extension to equational term rewriting described in Zantema [24] is however rather limited. In this paper we introduce a stronger version of equational semantical labelling, parameterized by three choices: (1) the order on the underlying algebra (partial order vs. quasi-order), (2) the r...
متن کاملSemantic Labelling for Termination of Combinatory Reduction Systems
We give a method of proving termination of Klop’s higher-order rewriting format, combinatory reduction system (CRS). Our method called higher-order semantic labelling is an extension of Zantema’s semantic labelling for first-order term rewriting systems. We systematically define the labelling by using the complete algebraic semantics of CRS.
متن کاملModular termination of basic narrowing and equational unification
Basic narrowing is a restricted form of narrowing which constrains narrowing steps to a set of unblocked (or basic) positions. In this work, we study the modularity of termination of basic narrowing in hierarchical combinations of TRSs, which provides new algorithmic criteria to prove termination of basic narrowing. Basic narrowing has a number of important applications including equational uni...
متن کاملEquational Theories of Abnormal Termination Based on Kleene Algebra
We study at an abstract level imperative while programs with an explicit fail operation that causes abnormal termination or irreparable failure, and a try-catch operation for error handling. There are two meaningful ways to define the semantics of such programs, depending on whether the final state of the computation can be observed upon failure or not. These two semantics give rise to differen...
متن کاملOperational Termination of Membership Equational Programs: the Order-Sorted Way
Our main goal is automating termination proofs for programs in rewriting-based languages with features such as: (i) expressive type structures, (ii) conditional rules, (iii) matching modulo axioms, and (iv) contextsensitive rewriting. Specifically, we present a new operational termination method for membership equational programs with features (i)-(iv) that can be applied to programs in members...
متن کامل